Particle Swarm Optimization for Solving Sine-Gordan Equation

نویسندگان

چکیده

The term ‘optimization’ refers to the process of maximizing beneficial attributes a mathematical function or system while minimizing unfavorable ones. majority real-world situations can be modelled as an optimization problem. complex nature models restricts traditional techniques obtain global optimal solution and paves path for methods. Particle Swarm Optimization is potential technique that has been widely used address problems in variety fields. idea this research use exponential basis functions particle swarm find numerical Sine-Gordan equation, whose solutions show soliton form diverse applications. implemented employed determine involved parameter functions, which was previously approximated random number work reported till now literature. obtained results are comparable with presented figures tables found encouraging.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Security Constrained Unit Commitment by Particle Swarm Optimization

The issue of unit commitment is one of the most important economic plans in power system. In modern and traditional power systems, in addition to being economical of the planning, the issue of security in unit operation is also of great importance. Hence power system operation confronts units’ participation and input considering network security constrains. The issue of units’ participation is ...

متن کامل

Unified Particle Swarm Optimization for Solving Constrained Engineering Optimization Problems

We investigate the performance of the recently proposed Unified Particle Swarm Optimization method on constrained engineering optimization problems. For this purpose, a penalty function approach is employed and the algorithm is modified to preserve feasibility of the encountered solutions. The algorithm is illustrated on four well–known engineering problems with promising results. Comparisons w...

متن کامل

Particle Swarm Optimization Based Diophantine Equation Solver

The paper introduces particle swarm optimization as a viable strategy to find numerical solution of Diophantine equation, for which there exists no general method of finding solutions. The proposed methodology uses a population of integer particles. The candidate solutions in the feasible space are optimised to have better positions through particle best and global best positions. The methodolo...

متن کامل

Solving Constrained Nonlinear Optimization Problems with Particle Swarm Optimization

This paper presents a Particle Swarm Optimization (PSO) algorithm for constrained nonlinear optimization problems. In PSO, the potential solutions, called particles, are "flown" through the problem space by learning from the current optimal particle and its own memory. In this paper, preserving feasibility strategy is employed to deal with constraints. PSO is started with a group of feasible so...

متن کامل

Hybrid Particle SWARM Optimization for Solving Machine Time Scheduling Problem

A hybrid particle swarm optimization (PSO) for multi-machine time scheduling problem (MTSP) with multicycles is proposed in this paper to choose the best starting time for each machine in each cycle under pre-described time window and a set of precedence machines for each machine; to minimize the total penalty cost. We developed hybrid algorithm by using a combination between PSO and Genetic Al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer systems science and engineering

سال: 2023

ISSN: ['0267-6192']

DOI: https://doi.org/10.32604/csse.2023.032404